Logic and Grammar
نویسنده
چکیده
Grammar can be formulated as a kind of substructural propositional logic. In support of this claim, we survey bare Gentzen style deductive systems and two kinds of non-commutative linear logic: intuitionistic and compact bilinear logic. We also glance at their categorical refinements.
منابع مشابه
Alternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کاملConstructing Finite Least Kripke Models for Positive Logic Programs in Serial Regular Grammar Logics
A serial context-free grammar logic is a normal multimodal logic L characterized by the seriality axioms and a set of inclusion axioms of the form 2tφ→ 2s1 . . .2skφ. Such an inclusion axiom corresponds to the grammar rule t→ s1 . . . sk. Thus the inclusion axioms of L capture a context-free grammar G(L). If for every modal index t, the set of words derivable from t using G(L) is a regular lang...
متن کاملA Logic Programming Approach to Parsing and Production in Fluid Construction Grammar
This paper presents a Logic Programming approach to parsing and production in Fluid Construction Grammar (FCG) [13]. It builds on previous work on the formalisation of FCG in terms of First Order Logic (FOL) concepts, more specifically on the definition of its core inference operations, unification and merge, in terms of FOL unification and search in the space of a particular set of FOL terms c...
متن کاملDeciding regular grammar logics with converse through first-order logic
We provide a simple translation of the satisfiability problem for regular grammar logics with converse into GF, which is the intersection of the guarded fragment and the 2-variable fragment of first-order logic. This translation is theoretically interesting because it translates modal logics with certain frame conditions into first-order logic, without explicitly expressing the frame conditions...
متن کاملGrammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures
A grammar logic refers to an extension to the multi-modal logic K in which the modal axioms are generated from a formal grammar. We consider a proof theory, in nested sequent calculus, of grammar logics with converse, i.e., every modal operator [a] comes with a converse [a]−1. Extending previous works on nested sequent systems for tense logics, we show all grammar logics (with or without conver...
متن کاملA Note on Negation in Categorial Grammar
A version of strong negation is introduced into Categorial Grammar. The resulting syntactic calculi turn out to be systems of connexive logic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Studia Logica
دوره 100 شماره
صفحات -
تاریخ انتشار 2012